________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 11:14:58
Input Data from:  dataset151.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :20
Ex.Facilities   :2
Total budget    :25000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,06025
Average f[i]   :4775
Average g[i,j] :1997,22222222222
Total demand   :10770
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 19
> Selected Move:	1020	1	-1	11	5500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0    >new incumb.: 1020


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 69
> Selected Move:	1720	1	-1	2	11000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0    >new incumb.: 1720


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 85
> Selected Move:	2380	1	-1	9	16500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0    >new incumb.: 2380


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 93
> Selected Move:	2980	1	-1	15	22500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  0  0  1  0  0  0  0    >new incumb.: 2980


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 93
> Selected Move:	2960	3	15	8	21000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 89
> Selected Move:	3350	1	-1	16	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0  0  0    >new incumb.: 3350


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 85
> Selected Move:	3190	3	8	6	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 84
> Selected Move:	3152	3	16	8	25500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 57
> Selected Move:	3145	3	6	13	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 75
> Selected Move:	3140	3	8	16	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 94
> Selected Move:	3090	3	13	10	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 85
> Selected Move:	3050	3	2	6	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 92
> Selected Move:	3070	3	10	8	24000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 90
> Selected Move:	3140	3	6	5	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 80
> Selected Move:	3180	3	9	2	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 84
> Selected Move:	3140	3	11	9	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 87
> Selected Move:	3070	3	5	6	24000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 91
> Selected Move:	3070	3	9	11	24000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 87
> Selected Move:	3080	3	16	18	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 90
> Selected Move:	3070	3	6	13	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 100
> Selected Move:	3080	3	18	17	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 97
> Selected Move:	3060	3	17	6	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 84
> Selected Move:	3060	3	6	16	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 97
> Selected Move:	3070	3	13	19	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 96
> Selected Move:	3040	3	19	12	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 97
> Selected Move:	3040	3	12	17	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 95
> Selected Move:	3030	3	17	18	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 97
> Selected Move:	3010	3	8	10	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 28 #######################


> Neighbours evaluated; 100
> Selected Move:	3060	3	16	6	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  1  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 29 #######################


> Neighbours evaluated; 86
> Selected Move:	3050	3	6	13	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 30 #######################


> Neighbours evaluated; 102
> Selected Move:	3040	3	18	6	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 31 #######################


> Neighbours evaluated; 84
> Selected Move:	3050	3	13	16	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  1  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 32 #######################


> Neighbours evaluated; 86
> Selected Move:	3050	3	11	9	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 33 #######################


> Neighbours evaluated; 95
> Selected Move:	3015	3	16	11	26000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  1  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 34 #######################


> Neighbours evaluated; 74
> Selected Move:	3010	3	6	13	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 35 #######################


> Neighbours evaluated; 88
> Selected Move:	3040	3	9	16	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 36 #######################


> Neighbours evaluated; 95
> Selected Move:	3020	3	13	12	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 37 #######################


> Neighbours evaluated; 96
> Selected Move:	3020	3	12	17	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 38 #######################


> Neighbours evaluated; 95
> Selected Move:	2990	3	17	5	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 39 #######################


> Neighbours evaluated; 86
> Selected Move:	2980	3	10	6	25000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 40 #######################


> Neighbours evaluated; 83
> Selected Move:	3065	3	16	8	25500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 41 #######################


> Neighbours evaluated; 70
> Selected Move:	3058	3	6	13	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 42 #######################


> Neighbours evaluated; 86
> Selected Move:	3015	3	2	9	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  1  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 43 #######################


> Neighbours evaluated; 85
> Selected Move:	3040	3	5	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 44 #######################


> Neighbours evaluated; 102
> Selected Move:	3040	3	11	2	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 45 #######################


> Neighbours evaluated; 103
> Selected Move:	3020	3	17	6	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 46 #######################


> Neighbours evaluated; 92
> Selected Move:	3025	3	13	5	25500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  1  1  0  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 47 #######################


> Neighbours evaluated; 77
> Selected Move:	3023	3	2	11	25500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 48 #######################


> Neighbours evaluated; 71
> Selected Move:	3020	3	5	13	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 49 #######################


> Neighbours evaluated; 89
> Selected Move:	3020	3	6	16	24000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 50 #######################


> Neighbours evaluated; 98
> Selected Move:	3030	3	13	19	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 51 #######################


> Neighbours evaluated; 97
> Selected Move:	3030	3	11	2	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 52 #######################


> Neighbours evaluated; 99
> Selected Move:	3020	3	19	13	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 53 #######################


> Neighbours evaluated; 100
> Selected Move:	3013	3	16	5	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1  0  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 54 #######################


> Neighbours evaluated; 89
> Selected Move:	2955	3	13	11	26500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 55 #######################


> Neighbours evaluated; 62
> Selected Move:	3005	3	5	12	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 56 #######################


> Neighbours evaluated; 88
> Selected Move:	3010	3	9	18	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  1  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 57 #######################


> Neighbours evaluated; 99
> Selected Move:	2990	3	12	17	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 58 #######################


> Neighbours evaluated; 99
> Selected Move:	3000	3	18	6	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 59 #######################


> Neighbours evaluated; 85
> Selected Move:	2995	3	6	9	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 60 #######################


> Neighbours evaluated; 86
> Selected Move:	3000	3	2	16	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 61 #######################


> Neighbours evaluated; 98
> Selected Move:	3000	3	11	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 62 #######################


> Neighbours evaluated; 101
> Selected Move:	3000	3	17	12	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 63 #######################


> Neighbours evaluated; 103
> Selected Move:	3000	3	2	11	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 64 #######################


> Neighbours evaluated; 100
> Selected Move:	2980	3	8	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 65 #######################


> Neighbours evaluated; 101
> Selected Move:	3000	3	12	13	24500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 66 #######################


> Neighbours evaluated; 102
> Selected Move:	3000	3	11	2	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 67 #######################


> Neighbours evaluated; 107
> Selected Move:	3000	3	16	6	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 68 #######################


> Neighbours evaluated; 95
> Selected Move:	3005	3	10	11	25500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 69 #######################


> Neighbours evaluated; 89
> Selected Move:	3000	3	2	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 70 #######################


> Neighbours evaluated; 97
> Selected Move:	2910	3	13	5	26000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  1  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 71 #######################


> Neighbours evaluated; 86
> Selected Move:	2993	3	6	16	25500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 72 #######################


> Neighbours evaluated; 94
> Selected Move:	3010	3	10	2	26000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 73 #######################


> Neighbours evaluated; 93
> Selected Move:	3003	3	5	15	26500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 74 #######################


> Neighbours evaluated; 95
> Selected Move:	2995	3	15	12	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 75 #######################


> Neighbours evaluated; 97
> Selected Move:	2993	3	12	17	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 76 #######################


> Neighbours evaluated; 98
> Selected Move:	2980	3	2	10	25000


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 77 #######################


> Neighbours evaluated; 100
> Selected Move:	2980	3	11	2	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 78 #######################


> Neighbours evaluated; 104
> Selected Move:	2985	3	17	5	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 79 #######################


> Neighbours evaluated; 96
> Selected Move:	2980	3	5	12	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 80 #######################


> Neighbours evaluated; 104
> Selected Move:	2890	3	16	11	26500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 81 #######################


> Neighbours evaluated; 98
> Selected Move:	2940	2	12	-1	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 82 #######################


> Neighbours evaluated; 97
> Selected Move:	2900	3	10	3	23000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 83 #######################


> Neighbours evaluated; 94
> Selected Move:	2870	3	3	5	22000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 84 #######################


> Neighbours evaluated; 95
> Selected Move:	2875	1	-1	6	26500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 85 #######################


> Neighbours evaluated; 65
> Selected Move:	2980	3	2	16	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 86 #######################


> Neighbours evaluated; 85
> Selected Move:	2980	3	11	2	25000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 87 #######################


> Neighbours evaluated; 91
> Selected Move:	2953	3	5	15	25500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  0  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 88 #######################


> Neighbours evaluated; 94
> Selected Move:	2955	3	2	11	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 89 #######################


> Neighbours evaluated; 92
> Selected Move:	2958	3	9	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  1  0  0  0  1  1  0  0  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 90 #######################


> Neighbours evaluated; 89
> Selected Move:	2945	3	6	13	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 91 #######################


> Neighbours evaluated; 100
> Selected Move:	2970	3	15	5	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 92 #######################


> Neighbours evaluated; 97
> Selected Move:	2940	3	13	18	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 93 #######################


> Neighbours evaluated; 95
> Selected Move:	2988	3	16	8	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 94 #######################


> Neighbours evaluated; 89
> Selected Move:	2965	3	5	19	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 95 #######################


> Neighbours evaluated; 97
> Selected Move:	2993	3	18	6	25500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 96 #######################


> Neighbours evaluated; 78
> Selected Move:	2980	3	6	9	26500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 97 #######################


> Neighbours evaluated; 75
> Selected Move:	2948	3	2	6	25500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 98 #######################


> Neighbours evaluated; 87
> Selected Move:	2960	3	19	17	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 99 #######################


> Neighbours evaluated; 90
> Selected Move:	2960	3	11	2	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1  0  0  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 100 #######################


> Neighbours evaluated; 92
> Selected Move:	2940	3	17	19	25500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1  0  0  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 101 #######################


> Neighbours evaluated; 87
> Selected Move:	2930	3	19	12	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  1  0  0  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 102 #######################


> Neighbours evaluated; 88
> Selected Move:	2970	3	9	11	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  1  0  0  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 103 #######################


> Neighbours evaluated; 83
> Selected Move:	2930	3	2	9	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1  0  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 104 #######################


> Neighbours evaluated; 90
> Selected Move:	2790	3	12	18	24500


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  1  1  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 105 #######################


> Neighbours evaluated; 93
> Selected Move:	2883	3	6	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 106 #######################


> Neighbours evaluated; 89
> Selected Move:	2860	3	8	16	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 107 #######################


> Neighbours evaluated; 96
> Selected Move:	2888	3	9	15	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 108 #######################


> Neighbours evaluated; 98
> Selected Move:	2830	3	15	6	24000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 109 #######################


> Neighbours evaluated; 97
> Selected Move:	2833	3	16	5	25500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 110 #######################


> Neighbours evaluated; 88
> Selected Move:	2900	3	18	10	26000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0  1  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 111 #######################


> Neighbours evaluated; 77
> Selected Move:	2900	3	2	16	24500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  1  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 112 #######################


> Neighbours evaluated; 85
> Selected Move:	2920	3	10	8	24000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 113 #######################


> Neighbours evaluated; 86
> Selected Move:	2950	3	5	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  0  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 114 #######################


> Neighbours evaluated; 84
> Selected Move:	2920	3	6	2	26000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 115 #######################


> Neighbours evaluated; 85
> Selected Move:	2943	3	3	4	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  0  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 116 #######################


> Neighbours evaluated; 84
> Selected Move:	2910	3	4	14	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 117 #######################


> Neighbours evaluated; 92
> Selected Move:	2868	3	2	9	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  1  1  0  1  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 118 #######################


> Neighbours evaluated; 95
> Selected Move:	2895	3	14	4	25500


> New Y[]: 
	
	 2  3  0  0  1  0  0  0  1  1  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 119 #######################


> Neighbours evaluated; 83
> Selected Move:	2893	3	11	2	25500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 120 #######################


> Neighbours evaluated; 88
> Selected Move:	2860	3	4	14	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  1  0  0  0  0  1  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 121 #######################


> Neighbours evaluated; 94
> Selected Move:	2845	3	14	3	26000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 122 #######################


> Neighbours evaluated; 83
> Selected Move:	2910	3	2	6	25000


> New Y[]: 
	
	 2  3  0  1  0  0  1  0  1  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 123 #######################


> Neighbours evaluated; 86
> Selected Move:	2880	3	3	5	24000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  1  0  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 124 #######################


> Neighbours evaluated; 90
> Selected Move:	2860	3	8	10	24500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  1  1  0  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 125 #######################


> Neighbours evaluated; 91
> Selected Move:	2825	3	16	2	26000


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  1  1  0  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 126 #######################


> Neighbours evaluated; 83
> Selected Move:	2810	3	6	13	26000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  1  0  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 127 #######################


> Neighbours evaluated; 93
> Selected Move:	2930	3	10	16	25000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  0  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 128 #######################


> Neighbours evaluated; 91
> Selected Move:	2930	3	2	11	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  0  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 129 #######################


> Neighbours evaluated; 93
> Selected Move:	2858	3	5	15	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  0  1  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 130 #######################


> Neighbours evaluated; 88
> Selected Move:	2855	3	11	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 131 #######################


> Neighbours evaluated; 98
> Selected Move:	2790	3	15	17	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  0  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 132 #######################


> Neighbours evaluated; 99
> Selected Move:	2835	3	16	10	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 133 #######################


> Neighbours evaluated; 99
> Selected Move:	2873	3	9	11	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 134 #######################


> Neighbours evaluated; 95
> Selected Move:	2840	3	10	18	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 135 #######################


> Neighbours evaluated; 100
> Selected Move:	2830	3	18	16	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 136 #######################


> Neighbours evaluated; 94
> Selected Move:	2820	3	17	18	24000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 137 #######################


> Neighbours evaluated; 93
> Selected Move:	2830	3	13	19	25000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 138 #######################


> Neighbours evaluated; 95
> Selected Move:	2860	3	18	10	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 139 #######################


> Neighbours evaluated; 92
> Selected Move:	2818	3	2	9	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 140 #######################


> Neighbours evaluated; 91
> Selected Move:	2815	3	11	2	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 141 #######################


> Neighbours evaluated; 96
> Selected Move:	2800	3	10	6	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  0  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 142 #######################


> Neighbours evaluated; 95
> Selected Move:	2800	3	2	11	25000


> New Y[]: 
	
	 2  3  0  0  0  0  1  0  0  1  0  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  0  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 143 #######################


> Neighbours evaluated; 91
> Selected Move:	2800	3	9	2	25000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 144 #######################


> Neighbours evaluated; 91
> Selected Move:	2760	3	6	9	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 145 #######################


> Neighbours evaluated; 81
> Selected Move:	2850	2	16	-1	22000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 146 #######################


> Neighbours evaluated; 95
> Selected Move:	2820	3	19	6	21000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 147 #######################


> Neighbours evaluated; 89
> Selected Move:	2810	3	6	13	21000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 148 #######################


> Neighbours evaluated; 96
> Selected Move:	2800	3	13	4	22500


> New Y[]: 
	
	 2  3  1  0  1  0  0  0  0  1  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 149 #######################


> Neighbours evaluated; 88
> Selected Move:	2770	3	4	16	20500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 150 #######################


> Neighbours evaluated; 88
> Selected Move:	2750	3	16	12	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 151 #######################


> Neighbours evaluated; 93
> Selected Move:	2750	3	12	14	22500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  0  1  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 152 #######################


> Neighbours evaluated; 92
> Selected Move:	2730	3	14	17	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 153 #######################


> Neighbours evaluated; 93
> Selected Move:	2815	1	-1	13	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 154 #######################


> Neighbours evaluated; 87
> Selected Move:	2850	3	2	10	25500


> New Y[]: 
	
	 2  3  0  0  0  0  0  0  0  1  1  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 155 #######################


> Neighbours evaluated; 97
> Selected Move:	2825	3	17	5	26000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  1  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 156 #######################


> Neighbours evaluated; 88
> Selected Move:	2870	3	9	2	26000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 157 #######################


> Neighbours evaluated; 83
> Selected Move:	2840	3	2	18	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 158 #######################


> Neighbours evaluated; 97
> Selected Move:	2860	3	10	8	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 159 #######################


> Neighbours evaluated; 100
> Selected Move:	2870	3	13	6	24500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0  0  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 160 #######################


> Neighbours evaluated; 89
> Selected Move:	2850	3	8	10	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  1  1  0  0  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 161 #######################


> Neighbours evaluated; 84
> Selected Move:	2830	3	18	13	25000


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  0  0  1  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 162 #######################


> Neighbours evaluated; 84
> Selected Move:	2850	3	10	8	24500


> New Y[]: 
	
	 2  3  0  0  0  1  1  0  1  0  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 163 #######################


> Neighbours evaluated; 87
> Selected Move:	2870	3	6	17	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  1  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 164 #######################


> Neighbours evaluated; 96
> Selected Move:	2850	3	13	2	26000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 165 #######################


> Neighbours evaluated; 87
> Selected Move:	2875	3	17	12	26000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  1  1  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 166 #######################


> Neighbours evaluated; 90
> Selected Move:	2850	3	5	17	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  1  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 167 #######################


> Neighbours evaluated; 99
> Selected Move:	2845	3	12	19	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 168 #######################


> Neighbours evaluated; 95
> Selected Move:	2855	3	17	5	26500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 169 #######################


> Neighbours evaluated; 81
> Selected Move:	2860	3	2	16	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  0  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 170 #######################


> Neighbours evaluated; 98
> Selected Move:	2850	3	19	13	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 171 #######################


> Neighbours evaluated; 99
> Selected Move:	2880	3	5	3	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 172 #######################


> Neighbours evaluated; 96
> Selected Move:	2880	3	13	9	26000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  1  0  1  0  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 173 #######################


> Neighbours evaluated; 85
> Selected Move:	2850	3	9	18	25000


> New Y[]: 
	
	 2  3  0  1  0  0  0  0  1  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 174 #######################


> Neighbours evaluated; 96
> Selected Move:	2820	3	3	5	24000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  0  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 175 #######################


> Neighbours evaluated; 101
> Selected Move:	2830	3	18	12	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 176 #######################


> Neighbours evaluated; 97
> Selected Move:	2830	3	12	17	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  1  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 177 #######################


> Neighbours evaluated; 98
> Selected Move:	2810	3	8	10	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 178 #######################


> Neighbours evaluated; 97
> Selected Move:	2830	3	17	13	24500


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  0  1  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 179 #######################


> Neighbours evaluated; 98
> Selected Move:	2810	3	13	12	25000


> New Y[]: 
	
	 2  3  0  0  0  1  0  0  0  0  1  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 180 #######################


> Neighbours evaluated; 96
> Selected Move:	2810	3	10	2	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  1  1  0  0  0  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 181 #######################


> Neighbours evaluated; 96
> Selected Move:	2813	3	12	17	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  1  0  0  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 182 #######################


> Neighbours evaluated; 94
> Selected Move:	2800	3	5	18	24500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 183 #######################


> Neighbours evaluated; 97
> Selected Move:	2838	3	16	10	25500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  1  1  0  0  0  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 184 #######################


> Neighbours evaluated; 101
> Selected Move:	2900	3	18	9	26500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  1  1  0  0  0  0  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 185 #######################


> Neighbours evaluated; 92
> Selected Move:	2920	3	17	5	27000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  1  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 186 #######################


> Neighbours evaluated; 76
> Selected Move:	2910	3	10	13	26500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  1  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 187 #######################


> Neighbours evaluated; 80
> Selected Move:	2880	3	5	15	27000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  1  0  1  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 188 #######################


> Neighbours evaluated; 86
> Selected Move:	2880	3	13	6	27000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  1  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 189 #######################


> Neighbours evaluated; 74
> Selected Move:	2825	3	9	18	26000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  1  0  0  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 190 #######################


> Neighbours evaluated; 92
> Selected Move:	2820	3	15	13	24500


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 191 #######################


> Neighbours evaluated; 96
> Selected Move:	2838	3	6	5	25500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  1  0  1  0  0  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 192 #######################


> Neighbours evaluated; 91
> Selected Move:	2825	3	18	6	25500


> New Y[]: 
	
	 2  3  1  0  0  1  1  0  0  0  0  1  0  1  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 193 #######################


> Neighbours evaluated; 87
> Selected Move:	2785	3	5	15	26000


> New Y[]: 
	
	 2  3  1  0  0  0  1  0  0  0  0  1  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 194 #######################


> Neighbours evaluated; 89
> Selected Move:	2790	3	6	18	26000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 195 #######################


> Neighbours evaluated; 93
> Selected Move:	2750	2	18	-1	21500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  1  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 196 #######################


> Neighbours evaluated; 100
> Selected Move:	2840	3	13	3	23500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 197 #######################


> Neighbours evaluated; 93
> Selected Move:	2820	3	15	8	22000


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 198 #######################


> Neighbours evaluated; 95
> Selected Move:	2800	3	8	10	22500


> New Y[]: 
	
	 2  3  1  1  0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 199 #######################


> Neighbours evaluated; 93
> Selected Move:	2770	3	3	5	21500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  1  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 200 #######################


> Neighbours evaluated; 92
> Selected Move:	2810	3	10	15	22500


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  0  0  0  1  0  0  0  1  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 201 #######################


> Neighbours evaluated; 94
> Selected Move:	2790	3	5	19	22500


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  0  0  0  1  0  0  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 202 #######################


> Neighbours evaluated; 98
> Selected Move:	2770	3	15	8	21000


> New Y[]: 
	
	 2  3  1  0  0  0  0  0  1  0  0  1  0  0  0  0  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 203 #######################


> Neighbours evaluated; 93
> Selected Move:	2790	3	19	5	21000


> New Y[]: 
	
	 2  3  1  0  0  1  0  0  1  0  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 204 #######################


> Neighbours evaluated; 89
> Selected Move:	2750	3	0	9	23000


> New Y[]: 
	
	 0  3  1  0  0  1  0  0  1  2  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 205 #######################


> Neighbours evaluated; 65
> Selected Move:	2780	3	5	3	24000


> New Y[]: 
	
	 0  3  1  1  0  0  0  0  1  2  0  1  0  0  0  0  0  0  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0  0 
 > pw :0,29
________________________________________________________________

Best solution found: 3350
Run Termination time: 31.01.2010 11:18:13
Run duration: 00:03:15.4843750
________________________________________________________________
